Two-stage Tabu Search for Solving Parallel Machine Problems
نویسندگان
چکیده
منابع مشابه
Solving Parallel Machine Scheduling Problems with Variable Depth Local Search
We present new local search heuristics for the problem of scheduling jobs on identical parallel machines with the goal of minimizing total weighted completion time. Our proposed algorithm is a local search method based on combining a variable number of insertion moves. We develop an efficient heuristic for finding a profitable sequence of insertion moves. In a computational study, we compare th...
متن کاملA tabu search algorithm for the multi-stage parallel machine problem with limited buffer capacities
We investigate the problem of scheduling N jobs on parallel machines in L successive stages with limited buffer capacities between stages. The primary objective is to find a schedule that would minimize the makespan. This problem is shown to be NP -hard in the strong sense. We develop a tabu search algorithm for this problem in which the search is limited to the space of permutation vectors of ...
متن کاملTabu search for solving optimization problems on Hopfield neural networks
Over the past few decades numerous attempts have been made to solve combinatorial optimization problems that are NP-complete or NP-hard in heuristic approach. A Hoppeld-type neural network is a method that is often used to solve problems such as Traveling Salesman Problem. However, it is diicult to nd an optimal solution because it is based on gradient descent and its energy function has many l...
متن کاملA Tabu Search Evolutionary Algorithm for Solving Constraint Satisfaction Problems
The paper introduces a hybrid Tabu Search-Evolutionary Algorithm for solving the constraint satisfaction problem, called STLEA. Extensive experimental fine-tuning of parameters of the algorithm was performed to optimise the performance of the algorithm on a commonly used test-set. The performance of the STLEA was then compared to the best known evolutionary algorithm and benchmark deterministic...
متن کاملA tabu search algorithm for parallel machine total tardiness problem
In this study, a Tabu Search (TS) approach to the parallel machine scheduling problem is presented. The problem considered consists of a set of independent jobs to be scheduled on a number of parallel processors to minimize total tardiness. Several surveys on parallel machine scheduling with due date related objectives [1, 2, 3] reveal that the NP-hard nature of the problem renders it a challen...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transactions of the Society of Instrument and Control Engineers
سال: 2002
ISSN: 0453-4654
DOI: 10.9746/sicetr1965.38.330